全文获取类型
收费全文 | 336107篇 |
免费 | 24525篇 |
国内免费 | 12391篇 |
学科分类
工业技术 | 373023篇 |
出版年
2024年 | 568篇 |
2023年 | 4988篇 |
2022年 | 7324篇 |
2021年 | 12032篇 |
2020年 | 9675篇 |
2019年 | 7847篇 |
2018年 | 9158篇 |
2017年 | 10366篇 |
2016年 | 9301篇 |
2015年 | 12311篇 |
2014年 | 16053篇 |
2013年 | 19592篇 |
2012年 | 20584篇 |
2011年 | 22896篇 |
2010年 | 19562篇 |
2009年 | 18765篇 |
2008年 | 18410篇 |
2007年 | 17791篇 |
2006年 | 18641篇 |
2005年 | 16436篇 |
2004年 | 10636篇 |
2003年 | 9426篇 |
2002年 | 8381篇 |
2001年 | 7694篇 |
2000年 | 8214篇 |
1999年 | 9809篇 |
1998年 | 8563篇 |
1997年 | 7009篇 |
1996年 | 6423篇 |
1995年 | 5438篇 |
1994年 | 4438篇 |
1993年 | 3198篇 |
1992年 | 2545篇 |
1991年 | 2016篇 |
1990年 | 1548篇 |
1989年 | 1260篇 |
1988年 | 1042篇 |
1987年 | 690篇 |
1986年 | 566篇 |
1985年 | 355篇 |
1984年 | 258篇 |
1983年 | 208篇 |
1982年 | 201篇 |
1981年 | 162篇 |
1980年 | 147篇 |
1979年 | 88篇 |
1978年 | 59篇 |
1977年 | 78篇 |
1976年 | 98篇 |
1975年 | 32篇 |
排序方式: 共有10000条查询结果,搜索用时 312 毫秒
991.
How to select a generator of Zp* is an important problem in cryptographic applications, where p is an odd prime. In this paper, we mainly consider the especial case that p is a safe prime, and give an algorithm for selecting a generator of Zp*,and find all generators of Zp* , where p is a safe prime. Our algorithm is more faster than the algorithm in [1]. Based on the proposed algorithm, one could find all generators of Zp* as well, where p is a perfect prime. 相似文献
992.
We present a multiple-channel video transmission scheme in wireless CDMA networks over multipath fading channels. We map an embedded video bitstream, which is encoded into multiple independently decodable layers by 3D-ESCOT video coding technique, to multiple CDMA channels. One video source layer is transmitted over one CDMA channel. Each video source layer is protected by a product channel code structure. A product channel code is obtained by the combination of a row code based on rate compatible punctured convolutional code (RCPC) with cyclic redundancy check (CRC) error detection and a source-channel column code, i.e., systematic rate-compatible Reed-Solomon (RS) style erasure code. For a given budget on the available bandwidth and total transmit power, the transmitter determines the optimal power allocations and the optimal transmission rates among multiple CDMA channels, as well as the optimal product channel code rate allocation, i.e., the optimal unequal Reed-Solomon code source/parity rate allocations and the optimal RCPC rate protection for each channel. In formulating such an optimization problem, we make use of results on the large-system CDMA performance for various multiuser receivers in multipath fading channels. The channel is modeled as the concatenation of wireless BER channel and a wireline packet erasure channel with a fixed packet loss probability. By solving the optimization problem, we obtain the optimal power level allocation and the optimal transmission rate allocation over multiple CDMA channels. For each CDMA channel, we also employ a fast joint source-channel coding algorithm to obtain the optimal product channel code structure. Simulation results show that the proposed framework allows the video quality to degrade gracefully as the fading worsens or the bandwidth decreases, and it offers improved video quality at the receiver. 相似文献
993.
储运罐区计算机监测系统的开发与应用 总被引:3,自引:1,他引:2
储运罐区计算机监测系统是石化企业自动控制的薄弱环节。中国石油集团公司抚顺石油一厂使用ZYG-101型电子智能液位仪,以及使用FIX组态软件完成该系统的数据库组态、工艺流程显示、实时和历史趋势显示、报警和报表等处理过程,通过二次表的串行口与计算机进行通信,由计算机实时监测每个罐的各种重要参数。运行证明:该系统测量误差小,数据实时性好.易于存储及远程传送,较理想地达到储运罐区的自动检测功能。 相似文献
994.
In this paper, we study a three-dimensional axisymmetric boundary-value problem of a slender cylinder composed of a nonlinearly elastic material subjected to an axial force. Starting from the field equations, after a transformation and proper scalings, we identify a small variable and two small parameters, which characterize the present problem. Then, by an approach involving compound series-asymptotic expansions, a nonlinear ODE is derived, which governs the axial strain (the first-term in the series expansion). By imposing the zero radial displacement conditions at two ends, we manage to get the analytical solution of the axial strain, from which all other physical quantities can be deduced and thus the three-dimensional displacement field can be determined. Graphical results are presented, which show that there are two boundary layers near the two ends while the middle part is in a state of almost uniform extension. The asymptotic structure of the analytical solution is derived, which offers clear explanations to the structure of the deformed configuration and shows that the thickness of both boundary layers is of the order of the radius. We also point out the relevance of the present results to the St. Venant’s problem. In particular, we obtain the explicit uniformly-valid exponentially small error term, when the obtained deformed configuration is compared to the configuration of a uniform extension. 相似文献
995.
胜利炼油厂重油加氢 (VRDS)装置的常压分馏塔为填料塔 ,2 0 0 1年检修开工后该系统出现异常 ,经过查找分析 ,确定轻烃 /产品减压渣油换热器和柴油汽提塔重沸器内漏是装置异常的主要原因 相似文献
996.
997.
998.
999.
1000.
Mining process models with non-free-choice constructs 总被引:6,自引:0,他引:6
Lijie Wen Wil M. P. van der Aalst Jianmin Wang Jiaguang Sun 《Data mining and knowledge discovery》2007,15(2):145-180
Process mining aims at extracting information from event logs to capture the business process as it is being executed. Process
mining is particularly useful in situations where events are recorded but there is no system enforcing people to work in a
particular way. Consider for example a hospital where the diagnosis and treatment activities are recorded in the hospital
information system, but where health-care professionals determine the “careflow.” Many process mining approaches have been
proposed in recent years. However, in spite of many researchers’ persistent efforts, there are still several challenging problems
to be solved. In this paper, we focus on mining non-free-choice constructs, i.e., situations where there is a mixture of choice
and synchronization. Although most real-life processes exhibit non-free-choice behavior, existing algorithms are unable to
adequately deal with such constructs. Using a Petri-net-based representation, we will show that there are two kinds of causal
dependencies between tasks, i.e., explicit and implicit ones. We propose an algorithm that is able to deal with both kinds
of dependencies. The algorithm has been implemented in the ProM framework and experimental results shows that the algorithm
indeed significantly improves existing process mining techniques. 相似文献